TSTP Solution File: PUZ087^1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : PUZ087^1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 13:13:20 EDT 2023
% Result : Timeout 299.98s 300.16s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : PUZ087^1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.15 % Command : do_cvc5 %s %d
% 0.15/0.37 % Computer : n027.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Sat Aug 26 22:25:35 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.22/0.50 %----Proving TH0
% 0.22/0.50 %------------------------------------------------------------------------------
% 0.22/0.50 % File : PUZ087^1 : TPTP v8.1.2. Released v4.0.0.
% 0.22/0.50 % Domain : Logic Calculi (Espistemic logic)
% 0.22/0.50 % Problem : Wise men puzzle
% 0.22/0.50 % Version : [Ben09] axioms.
% 0.22/0.50 % English : Once upon a time, a king wanted to find the wisest out of his
% 0.22/0.50 % three wisest men. He arranged them in a circle and told them that
% 0.22/0.50 % he would put a white or a black spot on their foreheads and that
% 0.22/0.50 % one of the three spots would certainly be white. The three wise
% 0.22/0.50 % men could see and hear each other but, of course, they could not
% 0.22/0.50 % see their faces reflected anywhere. The king, then, asked to each
% 0.22/0.50 % of them to find out the colour of his own spot. After a while, the
% 0.22/0.50 % wisest correctly answered that his spot was white.
% 0.22/0.50
% 0.22/0.50 % Refs : [Gol92] Goldblatt (1992), Logics of Time and Computation
% 0.22/0.50 % : [Bal98] Baldoni (1998), Normal Multimodal Logics: Automatic De
% 0.22/0.50 % : [Ben09] Benzmueller (2009), Email to Geoff Sutcliffe
% 0.22/0.50 % Source : [Ben09]
% 0.22/0.50 % Names : mmex4.p [Ben09]
% 0.22/0.50
% 0.22/0.50 % Status : Theorem
% 0.22/0.50 % Rating : 0.54 v8.1.0, 0.45 v7.5.0, 0.43 v7.4.0, 0.56 v7.3.0, 0.67 v7.2.0, 0.62 v7.0.0, 0.71 v6.4.0, 0.67 v6.3.0, 0.60 v6.2.0, 0.71 v6.1.0, 0.86 v5.5.0, 0.83 v5.4.0, 0.80 v5.1.0, 1.00 v5.0.0, 0.80 v4.1.0, 0.67 v4.0.0
% 0.22/0.50 % Syntax : Number of formulae : 101 ( 31 unt; 37 typ; 31 def)
% 0.22/0.50 % Number of atoms : 407 ( 36 equ; 0 cnn)
% 0.22/0.50 % Maximal formula atoms : 12 ( 6 avg)
% 0.22/0.50 % Number of connectives : 439 ( 4 ~; 4 |; 8 &; 415 @)
% 0.22/0.50 % ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% 0.22/0.50 % Maximal formula depth : 9 ( 4 avg)
% 0.22/0.50 % Number of types : 3 ( 1 usr)
% 0.22/0.50 % Number of type conns : 197 ( 197 >; 0 *; 0 +; 0 <<)
% 0.22/0.50 % Number of symbols : 44 ( 42 usr; 7 con; 0-3 aty)
% 0.22/0.50 % Number of variables : 101 ( 66 ^; 29 !; 6 ?; 101 :)
% 0.22/0.50 % SPC : TH0_THM_EQU_NAR
% 0.22/0.50
% 0.22/0.50 % Comments :
% 0.22/0.50 %------------------------------------------------------------------------------
% 0.22/0.50 %----Include embedding of quantified multimodal logic in simple type theory
% 0.22/0.50 %------------------------------------------------------------------------------
% 0.22/0.50 %----Declaration of additional base type mu
% 0.22/0.50 thf(mu_type,type,
% 0.22/0.50 mu: $tType ).
% 0.22/0.50
% 0.22/0.50 %----Equality
% 0.22/0.50 thf(meq_ind_type,type,
% 0.22/0.50 meq_ind: mu > mu > $i > $o ).
% 0.22/0.50
% 0.22/0.50 thf(meq_ind,definition,
% 0.22/0.50 ( meq_ind
% 0.22/0.50 = ( ^ [X: mu,Y: mu,W: $i] : ( X = Y ) ) ) ).
% 0.22/0.50
% 0.22/0.50 thf(meq_prop_type,type,
% 0.22/0.50 meq_prop: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.22/0.50
% 0.22/0.50 thf(meq_prop,definition,
% 0.22/0.50 ( meq_prop
% 0.22/0.50 = ( ^ [X: $i > $o,Y: $i > $o,W: $i] :
% 0.22/0.50 ( ( X @ W )
% 0.22/0.50 = ( Y @ W ) ) ) ) ).
% 0.22/0.50
% 0.22/0.50 %----Modal operators not, or, box, Pi
% 0.22/0.50 thf(mnot_type,type,
% 0.22/0.50 mnot: ( $i > $o ) > $i > $o ).
% 0.22/0.50
% 0.22/0.50 thf(mnot,definition,
% 0.22/0.50 ( mnot
% 0.22/0.50 = ( ^ [Phi: $i > $o,W: $i] :
% 0.22/0.50 ~ ( Phi @ W ) ) ) ).
% 0.22/0.50
% 0.22/0.50 thf(mor_type,type,
% 0.22/0.50 mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.22/0.50
% 0.22/0.50 thf(mor,definition,
% 0.22/0.50 ( mor
% 0.22/0.50 = ( ^ [Phi: $i > $o,Psi: $i > $o,W: $i] :
% 0.22/0.51 ( ( Phi @ W )
% 0.22/0.51 | ( Psi @ W ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(mand_type,type,
% 0.22/0.51 mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.22/0.51
% 0.22/0.51 thf(mand,definition,
% 0.22/0.51 ( mand
% 0.22/0.51 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mnot @ ( mor @ ( mnot @ Phi ) @ ( mnot @ Psi ) ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(mimplies_type,type,
% 0.22/0.51 mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.22/0.51
% 0.22/0.51 thf(mimplies,definition,
% 0.22/0.51 ( mimplies
% 0.22/0.51 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mor @ ( mnot @ Phi ) @ Psi ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(mimplied_type,type,
% 0.22/0.51 mimplied: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.22/0.51
% 0.22/0.51 thf(mimplied,definition,
% 0.22/0.51 ( mimplied
% 0.22/0.51 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mor @ ( mnot @ Psi ) @ Phi ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(mequiv_type,type,
% 0.22/0.51 mequiv: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.22/0.51
% 0.22/0.51 thf(mequiv,definition,
% 0.22/0.51 ( mequiv
% 0.22/0.51 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mand @ ( mimplies @ Phi @ Psi ) @ ( mimplies @ Psi @ Phi ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(mxor_type,type,
% 0.22/0.51 mxor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.22/0.51
% 0.22/0.51 thf(mxor,definition,
% 0.22/0.51 ( mxor
% 0.22/0.51 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mnot @ ( mequiv @ Phi @ Psi ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 %----Universal quantification: individuals
% 0.22/0.51 thf(mforall_ind_type,type,
% 0.22/0.51 mforall_ind: ( mu > $i > $o ) > $i > $o ).
% 0.22/0.51
% 0.22/0.51 thf(mforall_ind,definition,
% 0.22/0.51 ( mforall_ind
% 0.22/0.51 = ( ^ [Phi: mu > $i > $o,W: $i] :
% 0.22/0.51 ! [X: mu] : ( Phi @ X @ W ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(mforall_prop_type,type,
% 0.22/0.51 mforall_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
% 0.22/0.51
% 0.22/0.51 thf(mforall_prop,definition,
% 0.22/0.51 ( mforall_prop
% 0.22/0.51 = ( ^ [Phi: ( $i > $o ) > $i > $o,W: $i] :
% 0.22/0.51 ! [P: $i > $o] : ( Phi @ P @ W ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(mexists_ind_type,type,
% 0.22/0.51 mexists_ind: ( mu > $i > $o ) > $i > $o ).
% 0.22/0.51
% 0.22/0.51 thf(mexists_ind,definition,
% 0.22/0.51 ( mexists_ind
% 0.22/0.51 = ( ^ [Phi: mu > $i > $o] :
% 0.22/0.51 ( mnot
% 0.22/0.51 @ ( mforall_ind
% 0.22/0.51 @ ^ [X: mu] : ( mnot @ ( Phi @ X ) ) ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(mexists_prop_type,type,
% 0.22/0.51 mexists_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
% 0.22/0.51
% 0.22/0.51 thf(mexists_prop,definition,
% 0.22/0.51 ( mexists_prop
% 0.22/0.51 = ( ^ [Phi: ( $i > $o ) > $i > $o] :
% 0.22/0.51 ( mnot
% 0.22/0.51 @ ( mforall_prop
% 0.22/0.51 @ ^ [P: $i > $o] : ( mnot @ ( Phi @ P ) ) ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(mtrue_type,type,
% 0.22/0.51 mtrue: $i > $o ).
% 0.22/0.51
% 0.22/0.51 thf(mtrue,definition,
% 0.22/0.51 ( mtrue
% 0.22/0.51 = ( ^ [W: $i] : $true ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(mfalse_type,type,
% 0.22/0.51 mfalse: $i > $o ).
% 0.22/0.51
% 0.22/0.51 thf(mfalse,definition,
% 0.22/0.51 ( mfalse
% 0.22/0.51 = ( mnot @ mtrue ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(mbox_type,type,
% 0.22/0.51 mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.22/0.51
% 0.22/0.51 thf(mbox,definition,
% 0.22/0.51 ( mbox
% 0.22/0.51 = ( ^ [R: $i > $i > $o,Phi: $i > $o,W: $i] :
% 0.22/0.51 ! [V: $i] :
% 0.22/0.51 ( ~ ( R @ W @ V )
% 0.22/0.51 | ( Phi @ V ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(mdia_type,type,
% 0.22/0.51 mdia: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.22/0.51
% 0.22/0.51 thf(mdia,definition,
% 0.22/0.51 ( mdia
% 0.22/0.51 = ( ^ [R: $i > $i > $o,Phi: $i > $o] : ( mnot @ ( mbox @ R @ ( mnot @ Phi ) ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 %----Definition of properties of accessibility relations
% 0.22/0.51 thf(mreflexive_type,type,
% 0.22/0.51 mreflexive: ( $i > $i > $o ) > $o ).
% 0.22/0.51
% 0.22/0.51 thf(mreflexive,definition,
% 0.22/0.51 ( mreflexive
% 0.22/0.51 = ( ^ [R: $i > $i > $o] :
% 0.22/0.51 ! [S: $i] : ( R @ S @ S ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(msymmetric_type,type,
% 0.22/0.51 msymmetric: ( $i > $i > $o ) > $o ).
% 0.22/0.51
% 0.22/0.51 thf(msymmetric,definition,
% 0.22/0.51 ( msymmetric
% 0.22/0.51 = ( ^ [R: $i > $i > $o] :
% 0.22/0.51 ! [S: $i,T: $i] :
% 0.22/0.51 ( ( R @ S @ T )
% 0.22/0.51 => ( R @ T @ S ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(mserial_type,type,
% 0.22/0.51 mserial: ( $i > $i > $o ) > $o ).
% 0.22/0.51
% 0.22/0.51 thf(mserial,definition,
% 0.22/0.51 ( mserial
% 0.22/0.51 = ( ^ [R: $i > $i > $o] :
% 0.22/0.51 ! [S: $i] :
% 0.22/0.51 ? [T: $i] : ( R @ S @ T ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(mtransitive_type,type,
% 0.22/0.51 mtransitive: ( $i > $i > $o ) > $o ).
% 0.22/0.51
% 0.22/0.51 thf(mtransitive,definition,
% 0.22/0.51 ( mtransitive
% 0.22/0.51 = ( ^ [R: $i > $i > $o] :
% 0.22/0.51 ! [S: $i,T: $i,U: $i] :
% 0.22/0.51 ( ( ( R @ S @ T )
% 0.22/0.51 & ( R @ T @ U ) )
% 0.22/0.51 => ( R @ S @ U ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(meuclidean_type,type,
% 0.22/0.51 meuclidean: ( $i > $i > $o ) > $o ).
% 0.22/0.51
% 0.22/0.51 thf(meuclidean,definition,
% 0.22/0.51 ( meuclidean
% 0.22/0.51 = ( ^ [R: $i > $i > $o] :
% 0.22/0.51 ! [S: $i,T: $i,U: $i] :
% 0.22/0.51 ( ( ( R @ S @ T )
% 0.22/0.51 & ( R @ S @ U ) )
% 0.22/0.51 => ( R @ T @ U ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(mpartially_functional_type,type,
% 0.22/0.51 mpartially_functional: ( $i > $i > $o ) > $o ).
% 0.22/0.51
% 0.22/0.51 thf(mpartially_functional,definition,
% 0.22/0.51 ( mpartially_functional
% 0.22/0.51 = ( ^ [R: $i > $i > $o] :
% 0.22/0.51 ! [S: $i,T: $i,U: $i] :
% 0.22/0.51 ( ( ( R @ S @ T )
% 0.22/0.51 & ( R @ S @ U ) )
% 0.22/0.51 => ( T = U ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(mfunctional_type,type,
% 0.22/0.51 mfunctional: ( $i > $i > $o ) > $o ).
% 0.22/0.51
% 0.22/0.51 thf(mfunctional,definition,
% 0.22/0.51 ( mfunctional
% 0.22/0.51 = ( ^ [R: $i > $i > $o] :
% 0.22/0.51 ! [S: $i] :
% 0.22/0.51 ? [T: $i] :
% 0.22/0.51 ( ( R @ S @ T )
% 0.22/0.51 & ! [U: $i] :
% 0.22/0.51 ( ( R @ S @ U )
% 0.22/0.51 => ( T = U ) ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(mweakly_dense_type,type,
% 0.22/0.51 mweakly_dense: ( $i > $i > $o ) > $o ).
% 0.22/0.51
% 0.22/0.51 thf(mweakly_dense,definition,
% 0.22/0.51 ( mweakly_dense
% 0.22/0.51 = ( ^ [R: $i > $i > $o] :
% 0.22/0.51 ! [S: $i,T: $i,U: $i] :
% 0.22/0.51 ( ( R @ S @ T )
% 0.22/0.51 => ? [U: $i] :
% 0.22/0.51 ( ( R @ S @ U )
% 0.22/0.51 & ( R @ U @ T ) ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(mweakly_connected_type,type,
% 0.22/0.51 mweakly_connected: ( $i > $i > $o ) > $o ).
% 0.22/0.51
% 0.22/0.51 thf(mweakly_connected,definition,
% 0.22/0.51 ( mweakly_connected
% 0.22/0.51 = ( ^ [R: $i > $i > $o] :
% 0.22/0.51 ! [S: $i,T: $i,U: $i] :
% 0.22/0.51 ( ( ( R @ S @ T )
% 0.22/0.51 & ( R @ S @ U ) )
% 0.22/0.51 => ( ( R @ T @ U )
% 0.22/0.51 | ( T = U )
% 0.22/0.51 | ( R @ U @ T ) ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(mweakly_directed_type,type,
% 0.22/0.51 mweakly_directed: ( $i > $i > $o ) > $o ).
% 0.22/0.51
% 0.22/0.51 thf(mweakly_directed,definition,
% 0.22/0.51 ( mweakly_directed
% 0.22/0.51 = ( ^ [R: $i > $i > $o] :
% 0.22/0.51 ! [S: $i,T: $i,U: $i] :
% 0.22/0.51 ( ( ( R @ S @ T )
% 0.22/0.51 & ( R @ S @ U ) )
% 0.22/0.51 => ? [V: $i] :
% 0.22/0.51 ( ( R @ T @ V )
% 0.22/0.51 & ( R @ U @ V ) ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 %----Definition of validity
% 0.22/0.51 thf(mvalid_type,type,
% 0.22/0.51 mvalid: ( $i > $o ) > $o ).
% 0.22/0.51
% 0.22/0.51 thf(mvalid,definition,
% 0.22/0.51 ( mvalid
% 0.22/0.51 = ( ^ [Phi: $i > $o] :
% 0.22/0.51 ! [W: $i] : ( Phi @ W ) ) ) ).
% 0.22/0.51
% 0.22/0.51 %----Definition of invalidity
% 0.22/0.51 thf(minvalid_type,type,
% 0.22/0.51 minvalid: ( $i > $o ) > $o ).
% 0.22/0.51
% 0.22/0.51 thf(minvalid,definition,
% 0.22/0.51 ( minvalid
% 0.22/0.51 = ( ^ [Phi: $i > $o] :
% 0.22/0.51 ! [W: $i] :
% 0.22/0.51 ~ ( Phi @ W ) ) ) ).
% 0.22/0.51
% 0.22/0.51 %----Definition of satisfiability
% 0.22/0.51 thf(msatisfiable_type,type,
% 0.22/0.51 msatisfiable: ( $i > $o ) > $o ).
% 0.22/0.51
% 0.22/0.51 thf(msatisfiable,definition,
% 0.22/0.51 ( msatisfiable
% 0.22/0.51 = ( ^ [Phi: $i > $o] :
% 0.22/0.51 ? [W: $i] : ( Phi @ W ) ) ) ).
% 0.22/0.51
% 0.22/0.51 %----Definition of countersatisfiability
% 0.22/0.51 thf(mcountersatisfiable_type,type,
% 0.22/0.51 mcountersatisfiable: ( $i > $o ) > $o ).
% 0.22/0.51
% 0.22/0.51 thf(mcountersatisfiable,definition,
% 0.22/0.51 ( mcountersatisfiable
% 0.22/0.51 = ( ^ [Phi: $i > $o] :
% 0.22/0.51 ? [W: $i] :
% 0.22/0.51 ~ ( Phi @ W ) ) ) ).
% 0.22/0.51
% 0.22/0.51 %------------------------------------------------------------------------------
% 0.22/0.51 %------------------------------------------------------------------------------
% 0.22/0.51 thf(a,type,
% 0.22/0.51 a: $i > $i > $o ).
% 0.22/0.51
% 0.22/0.51 thf(b,type,
% 0.22/0.51 b: $i > $i > $o ).
% 0.22/0.51
% 0.22/0.51 thf(c,type,
% 0.22/0.51 c: $i > $i > $o ).
% 0.22/0.51
% 0.22/0.51 thf(fool,type,
% 0.22/0.51 fool: $i > $i > $o ).
% 0.22/0.51
% 0.22/0.51 thf(ws,type,
% 0.22/0.51 ws: ( $i > $i > $o ) > $i > $o ).
% 0.22/0.51
% 0.22/0.51 thf(axiom_1,axiom,
% 0.22/0.51 mvalid @ ( mbox @ fool @ ( mor @ ( ws @ a ) @ ( mor @ ( ws @ b ) @ ( ws @ c ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(axiom_2_a_b,axiom,
% 0.22/0.51 mvalid @ ( mbox @ fool @ ( mimplies @ ( ws @ a ) @ ( mbox @ b @ ( ws @ a ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(axiom_2_a_c,axiom,
% 0.22/0.51 mvalid @ ( mbox @ fool @ ( mimplies @ ( ws @ a ) @ ( mbox @ c @ ( ws @ a ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(axiom_2_b_a,axiom,
% 0.22/0.51 mvalid @ ( mbox @ fool @ ( mimplies @ ( ws @ b ) @ ( mbox @ a @ ( ws @ b ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(axiom_2_b_c,axiom,
% 0.22/0.51 mvalid @ ( mbox @ fool @ ( mimplies @ ( ws @ b ) @ ( mbox @ c @ ( ws @ b ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(axiom_2_c_a,axiom,
% 0.22/0.51 mvalid @ ( mbox @ fool @ ( mimplies @ ( ws @ c ) @ ( mbox @ a @ ( ws @ c ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(axiom_2_c_b,axiom,
% 0.22/0.51 mvalid @ ( mbox @ fool @ ( mimplies @ ( ws @ c ) @ ( mbox @ b @ ( ws @ c ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(axiom_3_a_b,axiom,
% 0.22/0.51 mvalid @ ( mbox @ fool @ ( mimplies @ ( mnot @ ( ws @ a ) ) @ ( mbox @ b @ ( mnot @ ( ws @ a ) ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(axiom_3_a_c,axiom,
% 0.22/0.51 mvalid @ ( mbox @ fool @ ( mimplies @ ( mnot @ ( ws @ a ) ) @ ( mbox @ c @ ( mnot @ ( ws @ a ) ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(axiom_3_b_a,axiom,
% 0.22/0.51 mvalid @ ( mbox @ fool @ ( mimplies @ ( mnot @ ( ws @ b ) ) @ ( mbox @ a @ ( mnot @ ( ws @ b ) ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(axiom_3_b_c,axiom,
% 0.22/0.51 mvalid @ ( mbox @ fool @ ( mimplies @ ( mnot @ ( ws @ b ) ) @ ( mbox @ c @ ( mnot @ ( ws @ b ) ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(axiom_3_c_a,axiom,
% 0.22/0.51 mvalid @ ( mbox @ fool @ ( mimplies @ ( mnot @ ( ws @ c ) ) @ ( mbox @ a @ ( mnot @ ( ws @ c ) ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(axiom_3_c_b,axiom,
% 0.22/0.51 mvalid @ ( mbox @ fool @ ( mimplies @ ( mnot @ ( ws @ c ) ) @ ( mbox @ b @ ( mnot @ ( ws @ c ) ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(t_axiom_for_fool,axiom,
% 0.22/0.51 ( mvalid
% 0.22/0.51 @ ( mforall_prop
% 0.22/0.51 @ ^ [A: $i > $o] : ( mimplies @ ( mbox @ fool @ A ) @ A ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(k_axiom_for_fool,axiom,
% 0.22/0.51 ( mvalid
% 0.22/0.51 @ ( mforall_prop
% 0.22/0.51 @ ^ [A: $i > $o] : ( mimplies @ ( mbox @ fool @ A ) @ ( mbox @ fool @ ( mbox @ fool @ A ) ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(i_axiom_for_fool_a,axiom,
% 0.22/0.51 ( mvalid
% 0.22/0.51 @ ( mforall_prop
% 0.22/0.51 @ ^ [Phi: $i > $o] : ( mimplies @ ( mbox @ fool @ Phi ) @ ( mbox @ a @ Phi ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(i_axiom_for_fool_b,axiom,
% 0.22/0.51 ( mvalid
% 0.22/0.51 @ ( mforall_prop
% 0.22/0.51 @ ^ [Phi: $i > $o] : ( mimplies @ ( mbox @ fool @ Phi ) @ ( mbox @ b @ Phi ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(i_axiom_for_fool_c,axiom,
% 0.22/0.51 ( mvalid
% 0.22/0.51 @ ( mforall_prop
% 0.22/0.51 @ ^ [Phi: $i > $o] : ( mimplies @ ( mbox @ fool @ Phi ) @ ( mbox @ c @ Phi ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(a7_axiom_for_fool_a_b,axiom,
% 0.22/0.52 ( mvalid
% 0.22/0.52 @ ( mforall_prop
% 0.22/0.52 @ ^ [Phi: $i > $o] : ( mimplies @ ( mbox @ a @ Phi ) @ ( mbox @ b @ ( mbox @ a @ Phi ) ) ) ) ) ).
% 0.22/0.52
% 0.22/0.52 thf(a7_axiom_for_fool_a_c,axiom,
% 0.22/0.52 ( mvalid
% 0.22/0.52 @ ( mforall_prop
% 0.22/0.52 @ ^ [Phi: $i > $o] : ( mimplies @ ( mbox @ a @ Phi ) @ ( mbox @ c @ ( mbox @ a @ Phi ) ) ) ) ) ).
% 0.22/0.52
% 0.22/0.52 thf(a7_axiom_for_fool_b_a,axiom,
% 0.22/0.52 ( mvalid
% 0.22/0.52 @ ( mforall_prop
% 0.22/0.52 @ ^ [Phi: $i > $o] : ( mimplies @ ( mbox @ b @ Phi ) @ ( mbox @ a @ ( mbox @ b @ Phi ) ) ) ) ) ).
% 0.22/0.52
% 0.22/0.52 thf(a7_axiom_for_fool_b_c,axiom,
% 0.22/0.52 ( mvalid
% 0.22/0.52 @ ( mforall_prop
% 0.22/0.52 @ ^ [Phi: $i > $o] : ( mimplies @ ( mbox @ b @ Phi ) @ ( mbox @ c @ ( mbox @ b @ Phi ) ) ) ) ) ).
% 0.22/0.52
% 0.22/0.52 thf(a7_axiom_for_fool_c_a,axiom,
% 0.22/0.52 ( mvalid
% 0.22/0.52 @ ( mforall_prop
% 0.22/0.52 @ ^ [Phi: $i > $o] : ( mimplies @ ( mbox @ c @ Phi ) @ ( mbox @ a @ ( mbox @ c @ Phi ) ) ) ) ) ).
% 0.22/0.52
% 0.22/0.52 thf(a7_axiom_for_fool_c_b,axiom,
% 0.22/0.52 ( mvalid
% 0.22/0.52 @ ( mforall_prop
% 0.22/0.52 @ ^ [Phi: $i > $o] : ( mimplies @ ( mbox @ c @ Phi ) @ ( mbox @ b @ ( mbox @ c @ Phi ) ) ) ) ) ).
% 0.22/0.52
% 0.22/0.52 thf(a6_axiom_for_fool_a_b,axiom,
% 0.22/0.52 ( mvalid
% 0.22/0.52 @ ( mforall_prop
% 0.22/0.52 @ ^ [Phi: $i > $o] : ( mimplies @ ( mnot @ ( mbox @ a @ Phi ) ) @ ( mbox @ b @ ( mnot @ ( mbox @ a @ Phi ) ) ) ) ) ) ).
% 0.22/0.52
% 0.22/0.52 thf(a6_axiom_for_fool_a_c,axiom,
% 0.22/0.52 ( mvalid
% 0.22/0.52 @ ( mforall_prop
% 0.22/0.52 @ ^ [Phi: $i > $o] : ( mimplies @ ( mnot @ ( mbox @ a @ Phi ) ) @ ( mbox @ c @ ( mnot @ ( mbox @ a @ Phi ) ) ) ) ) ) ).
% 0.22/0.52
% 0.22/0.52 thf(a6_axiom_for_fool_b_a,axiom,
% 0.22/0.52 ( mvalid
% 0.22/0.52 @ ( mforall_prop
% 0.22/0.52 @ ^ [Phi: $i > $o] : ( mimplies @ ( mnot @ ( mbox @ b @ Phi ) ) @ ( mbox @ a @ ( mnot @ ( mbox @ b @ Phi ) ) ) ) ) ) ).
% 0.22/0.52
% 0.22/0.52 thf(a6_axiom_for_fool_b_c,axiom,
% 0.22/0.52 ( mvalid
% 0.22/0.52 @ ( mforall_prop
% 0.22/0.52 @ ^ [Phi: $i > $o] : ( mimplies @ ( mnot @ ( mbox @ b @ Phi ) ) @ ( mbox @ c @ ( mnot @ ( mbox @ b @ Phi ) ) ) ) ) ) ).
% 0.22/0.52
% 0.22/0.52 thf(a6_axiom_for_fool_c_a,axiom,
% 0.22/0.52 ( mvalid
% 0.22/0.52 @ ( mforall_prop
% 0.22/0.52 @ ^ [Phi: $i > $o] : ( mimplies @ ( mnot @ ( mbox @ c @ Phi ) ) @ ( mbox @ a @ ( mnot @ ( mbox @ c @ Phi ) ) ) ) ) ) ).
% 0.22/0.52
% 0.22/0.52 thf(a6_axiom_for_fool_c_b,axiom,
% 0.22/0.52 ( mvalid
% 0.22/0.52 @ ( mforall_prop
% 0.22/0.52 @ ^ [Phi: $i > $o] : ( mimplies @ ( mnot @ ( mbox @ c @ Phi ) ) @ ( mbox @ b @ ( mnot @ ( mbox @ c @ Phi ) ) ) ) ) ) ).
% 0.22/0.52
% 0.22/0.52 thf(axiom_4,axiom,
% 0.22/0.52 mvalid @ ( mnot @ ( mbox @ a @ ( ws @ a ) ) ) ).
% 0.22/0.52
% 0.22/0.52 thf(axiom_5,axiom,
% 0.22/0.52 mvalid @ ( mnot @ ( mbox @ b @ ( ws @ b ) ) ) ).
% 0.22/0.52
% 0.22/0.52 thf(conj,conjecture,
% 0.22/0.52 mvalid @ ( mbox @ c @ ( ws @ c ) ) ).
% 0.22/0.52
% 0.22/0.52 %------------------------------------------------------------------------------
% 0.22/0.52 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.HQ9sNgDokQ/cvc5---1.0.5_23990.p...
% 0.22/0.52 (declare-sort $$unsorted 0)
% 0.22/0.52 (declare-sort tptp.mu 0)
% 0.22/0.52 (declare-fun tptp.meq_ind (tptp.mu tptp.mu $$unsorted) Bool)
% 0.22/0.52 (assert (= tptp.meq_ind (lambda ((X tptp.mu) (Y tptp.mu) (W $$unsorted)) (= X Y))))
% 0.22/0.52 (declare-fun tptp.meq_prop ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.52 (assert (= tptp.meq_prop (lambda ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool)) (W $$unsorted)) (= (@ X W) (@ Y W)))))
% 0.22/0.52 (declare-fun tptp.mnot ((-> $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.52 (assert (= tptp.mnot (lambda ((Phi (-> $$unsorted Bool)) (W $$unsorted)) (not (@ Phi W)))))
% 0.22/0.52 (declare-fun tptp.mor ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.52 (assert (= tptp.mor (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (W $$unsorted)) (or (@ Phi W) (@ Psi W)))))
% 0.22/0.52 (declare-fun tptp.mand ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.52 (assert (= tptp.mand (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ (@ tptp.mor (@ tptp.mnot Phi)) (@ tptp.mnot Psi))) __flatten_var_0))))
% 0.22/0.52 (declare-fun tptp.mimplies ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.52 (assert (= tptp.mimplies (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mor (@ tptp.mnot Phi)) Psi) __flatten_var_0))))
% 0.22/0.52 (declare-fun tptp.mimplied ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.52 (assert (= tptp.mimplied (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mor (@ tptp.mnot Psi)) Phi) __flatten_var_0))))
% 0.22/0.52 (declare-fun tptp.mequiv ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.52 (assert (= tptp.mequiv (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mand (@ (@ tptp.mimplies Phi) Psi)) (@ (@ tptp.mimplies Psi) Phi)) __flatten_var_0))))
% 0.22/0.52 (declare-fun tptp.mxor ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.52 (assert (= tptp.mxor (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ (@ tptp.mequiv Phi) Psi)) __flatten_var_0))))
% 0.22/0.52 (declare-fun tptp.mforall_ind ((-> tptp.mu $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.52 (assert (= tptp.mforall_ind (lambda ((Phi (-> tptp.mu $$unsorted Bool)) (W $$unsorted)) (forall ((X tptp.mu)) (@ (@ Phi X) W)))))
% 0.22/0.52 (declare-fun tptp.mforall_prop ((-> (-> $$unsorted Bool) $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.52 (assert (= tptp.mforall_prop (lambda ((Phi (-> (-> $$unsorted Bool) $$unsorted Bool)) (W $$unsorted)) (forall ((P (-> $$unsorted Bool))) (@ (@ Phi P) W)))))
% 0.22/0.52 (declare-fun tptp.mexists_ind ((-> tptp.mu $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.52 (assert (= tptp.mexists_ind (lambda ((Phi (-> tptp.mu $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ tptp.mforall_ind (lambda ((X tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ Phi X)) __flatten_var_0)))) __flatten_var_0))))
% 0.22/0.52 (declare-fun tptp.mexists_prop ((-> (-> $$unsorted Bool) $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.52 (assert (= tptp.mexists_prop (lambda ((Phi (-> (-> $$unsorted Bool) $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ tptp.mforall_prop (lambda ((P (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ Phi P)) __flatten_var_0)))) __flatten_var_0))))
% 0.22/0.52 (declare-fun tptp.mtrue ($$unsorted) Bool)
% 0.22/0.52 (assert (= tptp.mtrue (lambda ((W $$unsorted)) true)))
% 0.22/0.52 (declare-fun tptp.mfalse ($$unsorted) Bool)
% 0.22/0.52 (assert (= tptp.mfalse (@ tptp.mnot tptp.mtrue)))
% 0.22/0.52 (declare-fun tptp.mbox ((-> $$unsorted $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.52 (assert (= tptp.mbox (lambda ((R (-> $$unsorted $$unsorted Bool)) (Phi (-> $$unsorted Bool)) (W $$unsorted)) (forall ((V $$unsorted)) (or (not (@ (@ R W) V)) (@ Phi V))))))
% 0.22/0.52 (declare-fun tptp.mdia ((-> $$unsorted $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.52 (assert (= tptp.mdia (lambda ((R (-> $$unsorted $$unsorted Bool)) (Phi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ (@ tptp.mbox R) (@ tptp.mnot Phi))) __flatten_var_0))))
% 0.22/0.52 (declare-fun tptp.mreflexive ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.22/0.52 (assert (= tptp.mreflexive (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted)) (@ (@ R S) S)))))
% 0.22/0.52 (declare-fun tptp.msymmetric ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.22/0.52 (assert (= tptp.msymmetric (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted)) (=> (@ (@ R S) T) (@ (@ R T) S))))))
% 0.22/0.52 (declare-fun tptp.mserial ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.22/0.52 (assert (= tptp.mserial (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted)) (exists ((T $$unsorted)) (@ (@ R S) T))))))
% 0.22/0.52 (declare-fun tptp.mtransitive ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.22/0.52 (assert (= tptp.mtransitive (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ (@ R T) U)) (@ _let_1 U)))))))
% 0.22/0.52 (declare-fun tptp.meuclidean ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.22/0.52 (assert (= tptp.meuclidean (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ _let_1 U)) (@ (@ R T) U)))))))
% 0.22/0.52 (declare-fun tptp.mpartially_functional ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.22/0.52 (assert (= tptp.mpartially_functional (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ _let_1 U)) (= T U)))))))
% 0.22/0.52 (declare-fun tptp.mfunctional ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.22/0.52 (assert (= tptp.mfunctional (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted)) (exists ((T $$unsorted)) (and (@ (@ R S) T) (forall ((U $$unsorted)) (=> (@ (@ R S) U) (= T U)))))))))
% 0.22/0.52 (declare-fun tptp.mweakly_dense ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.22/0.52 (assert (= tptp.mweakly_dense (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (=> (@ (@ R S) T) (exists ((U $$unsorted)) (and (@ (@ R S) U) (@ (@ R U) T))))))))
% 0.22/0.52 (declare-fun tptp.mweakly_connected ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.22/0.52 (assert (= tptp.mweakly_connected (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ _let_1 U)) (or (@ (@ R T) U) (= T U) (@ (@ R U) T))))))))
% 0.22/0.52 (declare-fun tptp.mweakly_directed ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.22/0.52 (assert (= tptp.mweakly_directed (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ _let_1 U)) (exists ((V $$unsorted)) (and (@ (@ R T) V) (@ (@ R U) V)))))))))
% 0.22/0.52 (declare-fun tptp.mvalid ((-> $$unsorted Bool)) Bool)
% 0.22/0.52 (assert (= tptp.mvalid (lambda ((Phi (-> $$unsorted Bool))) (forall ((W $$unsorted)) (@ Phi W)))))
% 0.22/0.52 (declare-fun tptp.minvalid ((-> $$unsorted Bool)) Bool)
% 0.22/0.52 (assert (= tptp.minvalid (lambda ((Phi (-> $$unsorted Bool))) (forall ((W $$unsorted)) (not (@ Phi W))))))
% 0.22/0.52 (declare-fun tptp.msatisfiable ((-> $$unsorted Bool)) Bool)
% 0.22/0.52 (assert (= tptp.msatisfiable (lambda ((Phi (-> $$unsorted Bool))) (exists ((W $$unsorted)) (@ Phi W)))))
% 0.22/0.52 (declare-fun tptp.mcountersatisfiable ((-> $$unsorted Bool)) Bool)
% 0.22/0.52 (assert (= tptp.mcountersatisfiable (lambda ((Phi (-> $$unsorted Bool))) (exists ((W $$unsorted)) (not (@ Phi W))))))
% 0.22/0.52 (declare-fun tptp.a ($$unsorted $$unsorted) Bool)
% 0.22/0.52 (declare-fun tptp.b ($$unsorted $$unsorted) Bool)
% 0.22/0.52 (declare-fun tptp.c ($$unsorted $$unsorted) Bool)
% 0.22/0.52 (declare-fun tptp.fool ($$unsorted $$unsorted) Bool)
% 0.22/0.52 (declare-fun tptp.ws ((-> $$unsorted $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.52 (assert (@ tptp.mvalid (@ (@ tptp.mbox tptp.fool) (@ (@ tptp.mor (@ tptp.ws tptp.a)) (@ (@ tptp.mor (@ tptp.ws tptp.b)) (@ tptp.ws tptp.c))))))
% 0.22/0.52 (assert (let ((_let_1 (@ tptp.ws tptp.a))) (@ tptp.mvalid (@ (@ tptp.mbox tptp.fool) (@ (@ tptp.mimplies _let_1) (@ (@ tptp.mbox tptp.b) _let_1))))))
% 0.22/0.52 (assert (let ((_let_1 (@ tptp.ws tptp.a))) (@ tptp.mvalid (@ (@ tptp.mbox tptp.fool) (@ (@ tptp.mimplies _let_1) (@ (@ tptp.mbox tptp.c) _let_1))))))
% 0.22/0.52 (assert (let ((_let_1 (@ tptp.ws tptp.b))) (@ tptp.mvalid (@ (@ tptp.mbox tptp.fool) (@ (@ tptp.mimplies _let_1) (@ (@ tptp.mbox tptp.a) _let_1))))))
% 0.22/0.52 (assert (let ((_let_1 (@ tptp.ws tptp.b))) (@ tptp.mvalid (@ (@ tptp.mbox tptp.fool) (@ (@ tptp.mimplies _let_1) (@ (@ tptp.mbox tptp.c) _let_1))))))
% 0.22/0.52 (assert (let ((_let_1 (@ tptp.ws tptp.c))) (@ tptp.mvalid (@ (@ tptp.mbox tptp.fool) (@ (@ tptp.mimplies _let_1) (@ (@ tptp.mbox tptp.a) _let_1))))))
% 0.22/0.52 (assert (let ((_let_1 (@ tptp.ws tptp.c))) (@ tptp.mvalid (@ (@ tptp.mbox tptp.fool) (@ (@ tptp.mimplies _let_1) (@ (@ tptp.mbox tptp.b) _let_1))))))
% 0.22/0.52 (assert (let ((_let_1 (@ tptp.mnot (@ tptp.ws tptp.a)))) (@ tptp.mvalid (@ (@ tptp.mbox tptp.fool) (@ (@ tptp.mimplies _let_1) (@ (@ tptp.mbox tptp.b) _let_1))))))
% 0.22/0.52 (assert (let ((_let_1 (@ tptp.mnot (@ tptp.ws tptp.a)))) (@ tptp.mvalid (@ (@ tptp.mbox tptp.fool) (@ (@ tptp.mimplies _let_1) (@ (@ tptp.mbox tptp.c) _let_1))))))
% 0.22/0.52 (assert (let ((_let_1 (@ tptp.mnot (@ tptp.ws tptp.b)))) (@ tptp.mvalid (@ (@ tptp.mbox tptp.fool) (@ (@ tptp.mimplies _let_1) (@ (@ tptp.mbox tptp.a) _let_1))))))
% 0.22/0.52 (assert (let ((_let_1 (@ tptp.mnot (@ tptp.ws tptp.b)))) (@ tptp.mvalid (@ (@ tptp.mbox tptp.fool) (@ (@ tptp.mimplies _let_1) (@ (@ tptp.mbox tptp.c) _let_1))))))
% 0.22/0.52 (assert (let ((_let_1 (@ tptp.mnot (@ tptp.ws tptp.c)))) (@ tptp.mvalid (@ (@ tptp.mbox tptp.fool) (@ (@ tptp.mimplies _let_1) (@ (@ tptp.mbox tptp.a) _let_1))))))
% 0.22/0.52 (assert (let ((_let_1 (@ tptp.mnot (@ tptp.ws tptp.c)))) (@ tptp.mvalid (@ (@ tptp.mbox tptp.fool) (@ (@ tptp.mimplies _let_1) (@ (@ tptp.mbox tptp.b) _let_1))))))
% 0.22/0.52 (assert (@ tptp.mvalid (@ tptp.mforall_prop (lambda ((A (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mimplies (@ (@ tptp.mbox tptp.fool) A)) A) __flatten_var_0)))))
% 0.22/0.52 (assert (@ tptp.mvalid (@ tptp.mforall_prop (lambda ((A (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (let ((_let_1 (@ tptp.mbox tptp.fool))) (let ((_let_2 (@ _let_1 A))) (@ (@ (@ tptp.mimplies _let_2) (@ _let_1 _let_2)) __flatten_var_0)))))))
% 0.22/0.52 (assert (@ tptp.mvalid (@ tptp.mforall_prop (lambda ((Phi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mimplies (@ (@ tptp.mbox tptp.fool) Phi)) (@ (@ tptp.mbox tptp.a) Phi)) __flatten_var_0)))))
% 0.22/0.52 (assert (@ tptp.mvalid (@ tptp.mforall_prop (lambda ((Phi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mimplies (@ (@ tptp.mbox tptp.fool) Phi)) (@ (@ tptp.mbox tptp.b) Phi)) __flatten_var_0)))))
% 0.22/0.52 (assert (@ tptp.mvalid (@ tptp.mforall_prop (lambda ((Phi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mimplies (@ (@ tptp.mbox tptp.fool) Phi)) (@ (@ tptp.mbox tptp.c) Phi)) __flatten_var_0)))))
% 0.22/0.52 (assert (@ tptp.mvalid (@ tptp.mforall_prop (lambda ((Phi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (let ((_let_1 (@ (@ tptp.mbox tptp.a) Phi))) (@ (@ (@ tptp.mimplies _let_1) (@ (@ tptp.mbox tptp.b) _let_1)) __flatten_var_0))))))
% 0.22/0.52 (assert (@ tptp.mvalid (@ tptp.mforall_prop (lambda ((Phi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (let ((_let_1 (@ (@ tptp.mbox tptp.a) Phi))) (@ (@ (@ tptp.mimplies _let_1) (@ (@ tptp.mbox tptp.c) _let_1)) __flatten_var_0))))))
% 0.22/0.52 (assert (@ tptp.mvalid (@ tptp.mforall_prop (lambda ((Phi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (let ((_let_1 (@ (@ tptp.mbox tptp.b) Phi))) (@ (@ (@ tptp.mimplies _let_1) (@ (@ tptp.mbox tptp.a) _let_1)) __flatten_var_0))))))
% 0.22/0.52 (assert (@ tptp.mvalid (@ tptp.mforall_prop (lambda ((Phi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (let ((_let_1 (@ (@ tptp.mbox tptp.b) Phi))) (@ (@ (@ tptp.mimplies _let_1) (@ (@ tptp.mbox tptp.c) _let_1)) __flatten_var_0))))))
% 0.22/0.52 (assert (@ tptp.mvalid (@ tptp.mforall_prop (lambda ((Phi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (let ((_let_1 (@ (@ tptp.mbox tptp.c) Phi))) (@ (@ (@ tptp.mimplies _let_1) (@ (@ tptp.mbox tptp.a) _let_1)) __flatten_var_0))))))
% 0.22/0.52 (assert (@ tptp.mvalid (@ tptp.mforall_prop (lambda ((Phi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (let ((_let_1 (@ (@ tptp.mbox tptp.c) Phi))) (@ (@ (@ tptp.mimplies _let_1) (@ (@ tptp.mbox tptp.b) _let_1)) __flatten_var_0))))))
% 0.22/0.52 (assert (@ tptp.mvalid (@ tptp.mforall_prop (lambda ((Phi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (let ((_let_1 (@ tptp.mnot (@ (@ tptp.mbox tptp.a) Phi)))) (@ (@ (@ tptp.mimplies _let_1) (@ (@ tptp.mbox tptp.b) _let_1)) __flatten_var_0))))))
% 0.22/0.52 (assert (@ tptp.mvalid (@ tptp.mforall_prop (lambda ((Phi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (let ((_let_1 (@ tptp.mnot (@ (@ tptp.mbox tptp.a) Phi)))) (@ (@ (@ tptp.mimplies _let_1) (@ (@ tptp.mbox tptp.c) _let_1)) __flatten_var_0))))))
% 0.22/0.52 (assert (@ tptp.mvalid (@ tptp.mforall_prop (lambda ((Phi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (let ((_let_1 (@ tptp.mnot (@ (@ tptp.mbox tptp.b) Phi)))) (@ (@ (@ tptp.mimplies _let_1) (@ (@ tptp.mbox tptp.a) _let_1)) __flatten_var_0))))))
% 0.22/0.52 (assert (@ tptp.mvalid (@ tptp.mforall_prop (lambda ((Phi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (let ((_let_1 (@ tptp.mnot (@ (@ tptp.mbox tptp.b) Phi)))) (@ (@ (@ tptp.mimplies _let_1) (@ (@ tptp.mbox tptp.c) _let_1)) __flatten_var_0))))))
% 0.22/0.52 (assert (@ tptp.mvalid (@ tptp.mforall_prop (lambda ((Phi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (let ((_let_1 (@ tptp.mnot (@ (@ tptp.mbox tptp.c) Phi)))) (@ (@ (@ tptp.mimplies _let_1) (@ (@ tptp.mbox tptp.a) _let_1)) __flatten_var_0))))))
% 0.22/0.52 (assert (@ tptp.mvalid (@ tptp.mforall_prop (lambda ((Phi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (let ((_let_1 (@ tptp.mnot (@ (@ tptp.mbox tptp.c) Phi)))) (@ (@ (@ tptp.mimplies _let_1) (@ (@ tptp.mbox tptp.b) _let_1)) __flatten_var_0))))))
% 0.22/0.52 (assert (@ tptp.mvalid (@ tptp.mnot (/export/starexec/sandbox2/solver/bin/do_THM_THF: line 35: 24615 Alarm clock ( read result; case "$result" in
% 299.98/300.16 unsat)
% 299.98/300.16 echo "% SZS status $unsatResult for $tptpfilename"; echo "% SZS output start Proof for $tptpfilename"; cat; echo "% SZS output end Proof for $tptpfilename"; exit 0
% 299.98/300.16 ;;
% 299.98/300.16 sat)
% 299.98/300.16 echo "% SZS status $satResult for $tptpfilename"; cat; exit 0
% 299.98/300.16 ;;
% 299.98/300.16 esac; exit 1 )
% 299.98/300.17 Alarm clock
% 299.98/300.17 % cvc5---1.0.5 exiting
% 299.98/300.18 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------